Contents 3 . Minmax criteria 1
نویسندگان
چکیده
منابع مشابه
A Study on Consistency between MINAVE and MINMAX in SSIM Based Independent Perceptual Video Coding
In this letter, we study the R-D properties of independent sources based on MSE and SSIM, and compare the bit allocation performance under the MINAVE and MINMAX criteria in video encoding. The results show that MINMAX has similar results in terms of average distortion with MINAVE by using SSIM, which illustrates the consistency between these two criteria in independent perceptual video coding. ...
متن کاملA Review of the Minimum Maximum Criterion for Optimal Bit Allocation Among Dependent Quantizers
In this paper, we review a general framework for the optimal bit allocation among dependent quantizers based on the minimum maximum (MINMAX) distortion criterion. Pros and cons of this optimization criterion are discussed and compared to the well-known Lagrange multiplier method for the minimum average (MINAVE) distortion criterion. We argue that, in many applications, the MINMAX criterion is m...
متن کاملSensitivity analysis of efficient solution in vector MINMAX boolean programming problem ∗ Vladimir
We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31
متن کاملSensitivity analysis of efficient solution in vector MINMAX boolean programming problem
We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31
متن کاملApproximability and Parameterized Complexity of Minmax Values
We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ǫ log n digits (for any constant ǫ > 0) is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quas...
متن کامل